On a reachability problem for affine hypersurface systems on polytopes

نویسندگان

  • Zhiyun Lin
  • Mireille E. Broucke
چکیده

This paper studies the problem for an affine hypersurface system (with n− 1 inputs) to reach a polytopic target set starting from inside a polytope in the state space. We present a solution which begins with a characterization of solvability by openloop control and concludes with a procedure to synthesize a feedback control. Our emphasis is on methods of subdivision, triangulation, and covers which explicitly account for the capabilities of the control system. In contrast with previous literature, the partition methods are guaranteed to yield a correct feedback synthesis, assuming the problem is solvable by open-loop control.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Control to facet problems for affine systems on simplices and polytopes – With applications to control of hybrid systems

In this paper, a general control-to-facet problem for affine systems on polytopes is studied: find an affine feedback law such that all trajectories of the closed-loop system leave the state polytope through an a priori specified (possibly empty) set of facets. Solutions are presented in terms of (bi)linear inequalities in the coefficients of the affine feedback. The result is applied to contro...

متن کامل

On the Decidability of Reachability in Linear Time-Invariant Systems

We consider the decidability of state-to-state reachability in linear time-invariant control systems, with control sets defined by boolean combinations of linear inequalities. Decidability of the sub-problem in which control sets are linear subspaces is a fundamental result in control theory. We first show that reachability is undecidable if the set of controls is a finite union of affine subsp...

متن کامل

Reachability checking in complex and concurrent software systems using intelligent search methods

Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...

متن کامل

On The Complexity of Bounded Time Reachability for Piecewise Affine Systems

Reachability for piecewise affine systems is known to be undecidable, starting from dimension 2. In this paper we investigate the exact complexity of several decidable variants of reachability and control questions for piecewise affine systems. We show in particular that the region to region bounded time versions leads to NP -complete or co-NP -complete problems, starting from dimension 2.

متن کامل

Time-Constrained Temporal Logic Control of Multi-Affine Systems

We consider the problem of controlling a dynamical system such that its trajectories satisfy a temporal logic property in a given amount of time. We focus on multi-affine systems and specifications given as syntactically co-safe linear temporal logic formulas over rectangular regions in the state space. The proposed algorithm is based on the estimation of time bounds for facet reachability prob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Automatica

دوره 47  شماره 

صفحات  -

تاریخ انتشار 2011